منابع مشابه
Graded Self-Reducibility
We introduce two special kinds of self-reducible sets that we call time-graded and space-graded languages. Attaching time and space bounds to them yields a uniform, quantitative definition of resource-bounded self-reducibility that applies to all languages. We apply this to study the relationship between NSPACE[s(n)] and DSPACE[s(n)2], emphasizing the case s(n) = O(log n). We show that the clas...
متن کاملCoherence , Random - Self - Reducibility , and Self
We study three types of self-reducibility that are motivated by the theory of program veriication. A set A is random-self-reducible if one can determine whether an input x is in A by making random queries to an A-oracle. The distribution of each query may depend only on the length of x. A set B is self-correctable over a distribution D if one can convert a program that is correct on most of the...
متن کاملReducibility of Self-homotopy Equivalences
We describe a new general method for the computation of the group Aut(X) of self-homotopy equivalences of a space. It is based on the decomposition of Aut(X) induced by a factorization of X into a product of simpler spaces. Normally, such decompositions require assumptions (’induced equivalence property’, ’diagonalizability’), which are strongly restrictive and hard to check. In this paper we d...
متن کاملSelectivity and Self - Reducibility : NewCharacterizations of Complexity
It is known that a set is in P ii it is p-time Turing self-reducible and p-selective 2] and a p-time Turing self-reducible set is in NP \ coNP ii it is NP-selective 4]. We generalize these new characterizations to arbitrary time complexity classes. A simple and direct proof for the result of 2] is obtained. Probabilistic selectivity is also studied.
متن کاملLower Bounds on Random-Self-Reducibility
Informally speaking, a function f is random-self-reducible if, for any x, the computation of f(x) can be reduced to the computation of f on other \randomly chosen" inputs. Such functions are fundamental in many areas of theoretical computer science, including lower bounds, pseudorandom number-generators, interactive proof systems, zero-knowledge, instance-hiding, program-checking, and program-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1990
ISSN: 0022-0000
DOI: 10.1016/0022-0000(90)90025-g